Lectures on Integer Partitions
نویسنده
چکیده
2000, under the auspices of the Pacific Institute for the Mathematical Sciences. My original intent was to describe the sequence of developments which began in the 1980's and has led to a unified and automated approach to finding partition bijections. These developments, of six papers, in fact form much of the content of these notes, but it seemed desirable to preface them with some general background on the theory of partitions, and I could not resist ending with the development in [2], which concerns integer partitions in a wholly different way. The lecture notes were recorded by Joe Sawada, with such care that only a minimal buffing and polishing was necessary to get them into this form. My thanks go to Frank Ruskey, Florin Diacu and Irina Gavrilova for their hospitality in Victoria and for facilitating this work, and to Carla Savage for a number of helpful suggestions that improved the manuscript.
منابع مشابه
Stirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملA Product of Integer Partitions
I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer n. The bijection leads also to a product on partitions that is associative with a natural grading thus defining a free associative algebra on the set of integer partitions. As an outcome of the computati...
متن کاملLarge deviations for integer partitions
We consider deviations from limit shape induced by uniformly distributed partitions (and strict partitions) of an integer n on the associated Young diagrams. We prove a full large deviation principle, of speed p n. The proof, based on projective limits, uses the representation of the uniform measure on partitions by means of suitably conditioned independent variables.
متن کاملCorrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms
In this note, I discuss results on integer compositions/partitions given in the paper “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”. I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009